Uniqueness of solution in linear programming
نویسندگان
چکیده
منابع مشابه
Uniqueness of integer solution of linear equations
We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1,1}n by reformulating the problem as a linear program. Uniqueness characterizations of ordinary linear programming solutions are utilized to obtain sufficient uniqueness conditions such as the intersection of the kernel of A and the dual con...
متن کاملNumerical Solution of Interval Linear Programming
This paper presents an algorithm for solving interval linear programming(ILP) problems. Interval inequality constraints and equality constraints are discussed separately. The aim of the paper is to show that (ILP) problems can be decomposed into two general linear programming(LP) by the monotonicity of (LP) problems , and we can gain the interval objective values. Finally, the proposed method h...
متن کاملSparse nonnegative solution of underdetermined linear equations by linear programming.
Consider an underdetermined system of linear equations y = Ax with known y and d x n matrix A. We seek the nonnegative x with the fewest nonzeros satisfying y = Ax. In general, this problem is NP-hard. However, for many matrices A there is a threshold phenomenon: if the sparsest solution is sufficiently sparse, it can be found by linear programming. We explain this by the theory of convex polyt...
متن کاملA New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming
This paper describes a new optimization method for solving continuous semi-infinite linear problems. With regard to the dual properties, the problem is presented as a measure theoretical optimization problem, in which the existence of the solution is guaranteed. Then, on the basis of the atomic measure properties, a computation method was presented for obtaining the near optimal so...
متن کاملAbsolute Value Equation Solution Via Linear Programming
By utilizing a dual complementarity property, we propose a new linear programming method for solving the NP-hard absolute value equation (AVE): Ax−|x| = b, where A is an n×n square matrix. The algorithm makes no assumptions on the AVE other than solvability and consists of solving a few linear programs, typically less than four. The algorithm was tested on 500 consecutively generated random sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1979
ISSN: 0024-3795
DOI: 10.1016/0024-3795(79)90014-4